Facet browsing currently unavailable
Page 1 of 3172 results
Sort by: relevance publication year
Norm bounds and underestimators for unconstrained polynomial integer minimization JOURNAL ARTICLE published February 2018 in Mathematical Methods of Operations Research |
The blockwise coordinate descent method for integer programs JOURNAL ARTICLE published April 2020 in Mathematical Methods of Operations Research |
Variants of the $$ varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems JOURNAL ARTICLE published April 2018 in Mathematical Methods of Operations Research |
Optimal investment and consumption under partial information JOURNAL ARTICLE published February 2016 in Mathematical Methods of Operations Research |
Computational bounds for elevator control policies by large scale linear programming JOURNAL ARTICLE published February 2014 in Mathematical Methods of Operations Research |
Generalized light robustness and the trade-off between robustness and nominal quality JOURNAL ARTICLE published October 2014 in Mathematical Methods of Operations Research |
Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization JOURNAL ARTICLE published August 2011 in Mathematical Methods of Operations Research |
Polynomial combinatorial algorithms for skew-bisubmodular function minimization JOURNAL ARTICLE published September 2018 in Mathematical Programming Research funded by Japan Society for the Promotion of Science (JSPS KAKENHI Grant Number JP25280004,Postdoctoral Fellowships for Research Abroad) |
A polynomial oracle-time algorithm for convex integer minimization JOURNAL ARTICLE published January 2011 in Mathematical Programming |
An inexact proximal regularization method for unconstrained optimization JOURNAL ARTICLE published February 2017 in Mathematical Methods of Operations Research |
Component importance based on dependence measures JOURNAL ARTICLE published April 2018 in Mathematical Methods of Operations Research |
Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming JOURNAL ARTICLE published February 2011 in Mathematical Methods of Operations Research |
The double pivot simplex method JOURNAL ARTICLE published February 2018 in Mathematical Methods of Operations Research |
A test instance generator for multiobjective mixed-integer optimization JOURNAL ARTICLE published 19 July 2023 in Mathematical Methods of Operations Research |
Mixed integer linear models for the optimization of dynamical transport networks JOURNAL ARTICLE published June 2011 in Mathematical Methods of Operations Research |
An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization JOURNAL ARTICLE published April 2008 in Mathematical Methods of Operations Research |
Unboundedness in reverse convex and concave integer programming JOURNAL ARTICLE published October 2010 in Mathematical Methods of Operations Research |
On boundedness of (quasi-)convex integer optimization problems JOURNAL ARTICLE published December 2008 in Mathematical Methods of Operations Research |
Strong bounds on perturbations JOURNAL ARTICLE published August 2009 in Mathematical Methods of Operations Research |
Error bounds for stochastic shortest path problems JOURNAL ARTICLE published August 2017 in Mathematical Methods of Operations Research Research funded by National Science Foundation (IIS-1219114) |